منابع مشابه
XOR style tasks for testing visual object processing in monkeys
Using visually complex stimuli, three monkeys learned visual exclusive-or (XOR) tasks that required detecting two way visual feature conjunctions. Monkeys with passive exposure to the test images, or prior experience, were quicker to acquire an XOR style task. Training on each pairwise comparison of the stimuli to be used in an XOR task provided nearly complete transfer when stimuli became inte...
متن کاملXOR-based Visual Cryptography Schemes
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show that n out of n schemes...
متن کاملEasy Tasks Dominate Information Retrieval Evaluation Results
The evaluation of information retrieval systems involves the creation of potential user needs for which systems try to find relevant documents. The difficulty of these topics differs greatly and final scores for systems are typically based on the mean average. However, the topics which are relatively easy to solve, have a much larger impact on the final system ranking than hard topics. This pap...
متن کاملAn Easy to Use Tool for Rotational-XOR Cryptanalysis of ARX Block Ciphers
An increasing number of lightweight cryptographic primitives have been published in the last years. Some of these proposals only use additions, rotations and XORs, and these ARX primitives have shown a great performance in software. In this paper, a computer tool to automate the security evaluation of ARX block ciphers is shown. Our tool takes a Python implementation of an ARX block cipher and ...
متن کاملAre Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP–hard problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2004
ISSN: 1534-7362
DOI: 10.1167/4.8.732